Update 25 September 2014 I've substantially expanded Lecture 5, Color Correction. I've added 18 new slides to more thoroughly cover Hue, Saturation and Value (HSV) representation of color. In particular, the lecture now includes fast methods for computation of HSV. They are approximate but very fast. More updates to come; next will be the Fourier Lecture, Update 9 September 2014 Two slides on intensity scaling have been added to lecture 2, Digital Images and Matlab. I have added new material to... ( 23 reviews ) Topics: image processing, image enhancement, image noise reduction, Fourier transforms, convolution,...
This course covers the mathematical topics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis is placed on providing a context for the application of the mathematics within computer science. The analysis of algorithms requires the ability to count the... ( 15 reviews ) Topics: ars digita, computer science, discrete math, logic, proof techniques, recurrence relations, basic...
This class covers the definition of a function, vertical line test, function notation, finding input and output, domain and range, plus homework assignments. ( 6 reviews ) Topics: Mathematics, Calculus, Advanced Placement
Learn about the first Americans, the voyage of Christopher Columbus, and Cortez' defeat of the Aztecs. To watch the interactive media files (see left-hand column) first click the link to open it, then right-click anywhere on the page and select "play". ( 3 reviews ) Topics: American History, Advanced Placement
A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course. Text: Introduction to the Theory of Computation, Michael Sipser.... ( 8 reviews ) Topic: computation
In this course design and analysis of algorithms is studied. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Their applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. We study algorithm analysis - worst case, average case, and amortized, with an emphasis on the close connection between the time complexity of an... ( 8 reviews ) Topics: algorithms, algorithm design
The concepts of the Object-oriented paradigm using Java. The basic principles of software engineering are emphasized. We study how to design and think in an object oriented fashion. As a final project, students work in groups to develop a Gnutella distributed music-sharing client. Text: Core Java 2, Volume I: Fundamentals and Volume II: Advanced Features,Hortsmann and Cornell. Requirements: One exam, two problem sets, one project. ( 3 reviews ) Topic: object oriented programming
A more formal approach to Relational Database Management Systems, compared the way they were covered during Web Applications. Database systems are discussed from the physical layer of B-trees and file servers to the abstract layer of relational design. Also includes alternative and generic approaches to database design and database management system including relational, object-relational, and object-oriented systems, SQL standards, algebraic query languages, integrity constraints, triggers,... ( 3 reviews ) Topics: databases, relational database management systems, RDBMS